| 翻訳と辞書 |
| Rendezvous hashing ： ウィキペディア英語版 |
Rendezvous hashing
Rendezvous or Highest Random Weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of ''k'' options out of a possible set of ''n'' options. A typical application is when clients need to agree on which sites (or proxies) objects are to assigned to. When ''k'' is 1, it accomplishes goals similar to consistent hashing, using an entirely different method.
== History ==
Rendezvous hashing was invented in 1996 by David Thaler and Chinya Ravishankar at the University of Michigan. Consistent hashing appears to have been devised independently and simultaneously at MIT. One of the first applications of rendezvous hashing was to enable multicast clients on the Internet (in contexts such as the MBONE) to identify multicast rendezvous points in a distributed fashion. It was used in 1998 by Microsoft's Cache Array Routing Protocol (CARP) for distributed cache coordination and routing.〔(【引用サイトリンク】url=http://oldsite.mcoecn.org/WhitePapers/Mscarp.pdf )〕 It has also been used in applications such as mobile caching, router design, and secure key establishment.
Some Protocol Independent Multicast routing protocols use rendezvous hashing to pick a rendezvous point.〔
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Rendezvous hashing」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|